A unified construction of semiring-homomorphic graph invariants
نویسندگان
چکیده
It has recently been observed by Zuiddam that finite graphs form a preordered commutative semiring under the graph homomorphism preorder together with join and disjunctive product as addition multiplication, respectively. This led to new characterization of Shannon capacity $\Theta$ via Strassen's Positivstellensatz: $\Theta(\bar{G}) = \inf_f f(G)$, where $f : \mathsf{Graph} \to \mathbb{R}_+$ ranges over all monotone homomorphisms. Constructing classifying invariants $\mathsf{Graph} which are homomorphisms, additive join, multiplicative is therefore major interest. We call such semiring-homomorphic. The only known fractional nature: chromatic number, projective rank, Haemers bounds, well Lov\'asz number (with latter two evaluated on complementary graph). Here, we provide unified construction these based linear-like families graphs. Along way, also investigate additional algebraic structure corresponding fractionalization. Linear-like concept combinatorial geometry different from matroids may be independent
منابع مشابه
The total graph of a commutative semiring with respect to proper ideals
Let $I$ be a proper ideal of a commutative semiring $R$ and let $P(I)$ be the set of all elements of $R$ that are not prime to $I$. In this paper, we investigate the total graph of $R$ with respect to $I$, denoted by $T(Gamma_{I} (R))$. It is the (undirected) graph with elements of $R$ as vertices, and for distinct $x, y in R$, the vertices $x$ and $y$ are adjacent if and only if $x + y in P(I)...
متن کاملdiscursive motivation/demotivation construction: a case of iranian efl majors
بررسی نقش گفتمان در شکل گیری یا کاهش انگیزش فراگیران زبان خارجی موضوع تحقیق نسبتاً جدیدی است. از این رو، تحقیقات کمی در این زمینه وجود دارد. به منظور پر کردن این خلاء ، مطالعه کنونی به بررسی فرآیند گفتمان مدار شکل گیری یا کاهش انگیزش دانشجویان ایرانی زبان انگلیسی پرداخت. نخست، این مطالعه به صورت آزمایشی با 7 نفر (? دانشجوی پسر و 5 دختر) از دانشجویان سال دوم دوره ی کارشناسی زبان و ادبیات انگلیسی ...
Utilizing Automatically Inferred Invariants in Graph Construction and Search
In this paper we explore the relative importance of persistent mid non-persistent mutex relations in the perfornmnce of Graphpl~m-based planners. We also show tlm advantages of pre-compiling persistent mutex reindons. ITsing TIM we are able to generate, during a prepr.cessing analysis, all of the persistent Ifinary nmtex relations that would be infi,rred by Graphplan during graph construction. ...
متن کاملHomomorphic Encryption 4 : Construction of fully homomorphic encryption .
Assumption We’ll make the following “learning divisor with noise” assumption: LDN Assumption: let P a random n bit prime, R a random n4 bit prime, and let N = PR. A distinguisher that is given N and X1, . . . , Xpoly(n) cannot distinguish between case (I) Xi’s are chosen independently at random from [N ], and (II) Xi = PQi + 2Ei (mod N) where Qi is chosen independently at random from [R] and Ei...
متن کاملAn Ideal-based Zero-divisor Graph of a Commutative Semiring
There is a natural graph associated to the zero-divisors of a commutative semiring with non-zero identity. In this article we essentially study zero-divisor graphs with respect to primal and non-primal ideals of a commutative semiring R and investigate the interplay between the semiring-theoretic properties of R and the graph-theoretic properties of ΓI(R) for some ideal I of R. We also show tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Combinatorics
سال: 2021
ISSN: ['0925-9899', '1572-9192']
DOI: https://doi.org/10.1007/s10801-020-00983-y